Speci cations with Observable Formulae and ObservationalSatisfaction RelationTeodor
نویسندگان
چکیده
We consider algebraic speciications with observational features. Axioms as well as observations are formulae of full (Many-Sorted) First Order Logic with Equality. The associated semantics is based on a non standard interpretation of equality called observational equality. We study the adequacy of this semantics for software speciication and the relationship with behavioural equivalence of algebras. We show that this framework deenes an institution.
منابع مشابه
Speci cations with Observable
We consider algebraic speciications with observational features. Axioms as well as observations are formulae of full (Many-Sorted) First Order Logic with Equality. The associated semantics is based on a non standard interpretation of equality called observational equality. We study the adequacy of this semantics for software specii-cation and the relationship with behavioural equivalence of alg...
متن کاملFormal speci cations and test : correctness and oraclePascale
This article presents a new formal approach to testing. In the eld of dynamic testing, as soon as a program fails for a test set, it is agged incorrect. The remaining question is: how far can a successful program be considered as correct? We give a de nition of program correctness with respect to a speci cation which is adequate to dynamic testing. Similarly to the eld of abstract implementatio...
متن کاملGeneralizing BIAS Speci cations
This paper generalizes the speci cation of Basic Interval Arithmetic Subroutines (BIAS) to support interval arithmetic on directed (i.e. proper and improper) intervals. This is due to our understanding that the arithmetic involving improper intervals will be increasingly used in future applications and the corresponding interval arithmetic implementations require no additional cost. We extend B...
متن کاملPropositional Linear Temporal Logic and Language Homomorphisms
When verifying speci cations of reactive systems|which are at least nonterminating computer programs|the complexity of the veri cation algorithm is a major problem of practical relevance. Speci cations of practical interest are usually too large to be veri ed by standard veri cation methods in an acceptable amount of time. So what can we do? We can try to get rid of information in the speci cat...
متن کاملTesting Linear Temporal Logic Formulae on Finite Execution Traces
We present an algorithm for e ciently testing Linear Temporal Logic (LTL) formulae on nite execution traces. The standard models of LTL are in nite traces, re ecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991